Intuitionistic type theory

Results: 42



#Item
21Type theory / Functional languages / Lambda calculus / Logic in computer science / Theory of computation / Agda / Intuitionistic type theory / Dependent type / Typed lambda calculus / Software engineering / Programming language theory / Theoretical computer science

Dependent Types at Work Ana Bove and Peter Dybjer Chalmers University of Technology, G¨ oteborg, Sweden {bove,peterd}@chalmers.se

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2013-09-04 09:56:00
22Type theory / Logic in computer science / Dependently typed programming / Computability theory / Intuitionistic type theory / Curry–Howard correspondence / Natural deduction / Lambda calculus / Combinatory logic / Mathematics / Logic / Mathematical logic

Innovations in Computational Type Theory using Nuprl S. F. Allen, M. Bickford, R. L. Constable, R. Eaton, C. Kreitz, L. Lorigo, E. Moran Department of Computer Science, Cornell-University, Ithaca, NY[removed] {sfa,mark

Add to Reading List

Source URL: www.nuprl.org

Language: English - Date: 2005-06-21 10:54:34
23Abstract algebra / Homotopy / Path / Quasigroup / Covering space / Intuitionistic type theory / Fundamental group / CW complex / Function / Topology / Mathematics / Homotopy theory

Homotopical Patch Theory (Expanded Version) Carlo Angiuli ∗ Edward Morehouse ∗

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2014-07-29 20:48:31
24Abstract algebra / Homotopy / Path / Covering space / Quasigroup / Intuitionistic type theory / Out / Fundamental group / Bijection /  injection and surjection / Topology / Homotopy theory / Mathematics

PDF Document

Add to Reading List

Source URL: dlicata.web.wesleyan.edu

Language: English - Date: 2014-05-05 05:23:52
25Mathematical logic / Programming idioms / Type theory / Recursion / Theoretical computer science / Intuitionistic type theory / Initial algebra / Mathematical proof / Inductive reasoning / Mathematics / Computer programming / Logic

UNIVERSITY OF GRONINGEN Inductive Types in Constructive Languages Peter J. de Bruin

Add to Reading List

Source URL: www.peterdebruin.net

Language: English - Date: 2010-01-10 15:07:06
26Non-classical logic / Logic in computer science / Type theory / Dependently typed programming / Automated theorem proving / Logical framework / Frank Pfenning / Natural deduction / Intuitionistic logic / Logic / Mathematical logic / Mathematics

Research Statement Jason Reed Research Agenda Motivations Mathematics succeeds when it builds bridges: a result connecting one approach (or one entire field

Add to Reading List

Source URL: jcreed.org

Language: English - Date: 2009-10-03 17:18:21
27Type theory / Theoretical computer science / Non-classical logic / Dependently typed programming / Logical framework / Intuitionistic logic / Frank Pfenning / Dependent type / Natural deduction / Mathematical logic / Logic / Logic in computer science

CLF: A logical framework for concurrent systems Thesis Proposal Kevin Watkins Carnegie Mellon University Committee:

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2003-05-13 12:40:00
28Structural induction / Mathematical proof / Mathematical induction / Well-quasi-ordering / Axiom of choice / Recursion / Intuitionistic type theory / Well-founded relation / Bar induction / Mathematics / Mathematical logic / Logic

Applications of inductive definitions and choice principles to program synthesis Ulrich Berger and Monika Seisenberger {u.berger,csmona}@swansea.ac.uk University of Wales Swansea

Add to Reading List

Source URL: www-compsci.swan.ac.uk

Language: English - Date: 2006-06-27 17:59:13
29Algebraic topology / Algebraic geometry / Category theory / Combinatorial species / Sheaf / Model theory / Finite set / Intuitionistic type theory / Finite morphism / Mathematics / Abstract algebra / Algebraic combinatorics

Labelled structures and combinatorial species Brent A. Yorgey

Add to Reading List

Source URL: www.cis.upenn.edu

Language: English - Date: 2014-01-10 16:35:05
30Set theory / Z notation / Type theory / Axiom / Mathematical constructivism / Model theory / Mathematical proof / S / Intuitionistic type theory / Mathematical logic / Logic / Mathematics

Negative consistent axioms can be postulated without loss of canonicity Thierry Coquand, Nils Anders Danielsson, Mart´ın H¨

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2013-10-19 03:17:32
UPDATE